A New Constrained Parameter Estimator: Experiments in Fundamental Matrix Computation
نویسندگان
چکیده
In recent work the authors proposed a wide-ranging method for estimating parameters that constrain image feature locations and satisfy a constraint not involving image data. The present work illustrates the use of the method with experiments concerning estimation of the fundamental matrix. Results are given for both synthetic and real images. It is demonstrated that the method gives results commensurate with, or superior to, previous approaches, with the advantage of being fast.
منابع مشابه
A new constrained parameter estimator for computer vision applications
A method of constrained parameter estimation is proposed for a class of computer vision problems. In a typical application, the parameters will describe a relationship between image feature locations, expressed as an equation linking the parameters and the image data, and will satisfy an ancillary constraint not involving the image data. A salient feature of the method is that it handles the an...
متن کاملA new parameter Learning Method for Bayesian Networks with Qualitative Influences
We propose a new method for parameter learning in Bayesian networks with qualitative influences. This method extends our previous work from networks of binary variables to networks of discrete variables with ordered values. The specified qualitative influences correspond to certain order restrictions on the parameters in the network. These parameters may therefore be estimated using constrained...
متن کاملA New Ridge Estimator in Linear Measurement Error Model with Stochastic Linear Restrictions
In this paper, we propose a new ridge-type estimator called the new mixed ridge estimator (NMRE) by unifying the sample and prior information in linear measurement error model with additional stochastic linear restrictions. The new estimator is a generalization of the mixed estimator (ME) and ridge estimator (RE). The performances of this new estimator and mixed ridge estimator (MRE) against th...
متن کاملComputing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method
A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...
متن کاملThe Structure of Bhattacharyya Matrix in Natural Exponential Family and Its Role in Approximating the Variance of a Statistics
In most situations the best estimator of a function of the parameter exists, but sometimes it has a complex form and we cannot compute its variance explicitly. Therefore, a lower bound for the variance of an estimator is one of the fundamentals in the estimation theory, because it gives us an idea about the accuracy of an estimator. It is well-known in statistical inference that the Cram&eac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002